A hybrid self-adjusted mean value method for reliability-based design optimization using sufficient descent condition
نویسندگان
چکیده
منابع مشابه
RELIABILITY-BASED DESIGN OPTIMIZATION OF COMPLEX FUNCTIONS USING SELF-ADAPTIVE PARTICLE SWARM OPTIMIZATION METHOD
A Reliability-Based Design Optimization (RBDO) framework is presented that accounts for stochastic variations in structural parameters and operating conditions. The reliability index calculation is itself an iterative process, potentially employing an optimization technique to find the shortest distance from the origin to the limit-state boundary in a standard normal space. Monte Carlo simulati...
متن کاملHybrid Analysis Method for Reliability-based Design Optimization
Reliability-Based Design Optimization (RBDO) involves evaluation of probabilistic constraints, which can be done in two different ways, the Reliability Index Approach (RIA) and the Performance Measure Approach (PMA). It has been reported in the literature that RIA yields instability for some problems but PMA is robust and efficient in identifying a probabilistic failure mode in the RBDO process...
متن کاملA New Sufficient Descent Conjugate Gradient Method for Unconstrained Optimization
In this paper, a new conjugate conjugate method with sufficient descent property is proposed for the unconstrained optimization problem. An attractive property of the new method is that the descent direction generated by the method always possess the sufficient descent property, and this property is independent of the line search used and the choice of ki . Under mild conditions, the global c...
متن کاملModified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization
In this paper, an efficient modified nonlinear conjugate gradient method for solving unconstrained optimization problems is proposed. An attractive property of the modified method is that the generated direction in each step is always descending without any line search. The global convergence result of the modified method is established under the general Wolfe line search condition. Numerical r...
متن کاملA hybrid steepest descent method for constrained convex optimization
This paper describes a hybrid steepest descent method to decrease over time any given convex cost function while keeping the optimization variables into any given convex set. The method takes advantage of properties of hybrid systems to avoid the computation of projections or of a dual optimum. The convergence to a global optimum is analyzed using Lyapunov stability arguments. A discretized imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2017
ISSN: 0307-904X
DOI: 10.1016/j.apm.2016.08.031